On Computing Least Order Fault Detectors Using Rational Nullspace Bases
نویسنده
چکیده
We propose a numerically reliable computational approach to design least order fault detectors using descriptor system techniques. This approach is based on a new numerically stable algorithm to compute least order rational nullspace bases of rational matrices. The main computation in this algorithm is the orthogonal reduction of the system pencil matrix to a Kronecker-like form. The proposed approach can be combined with coprime factorization techniques to determine stable rational bases. Least order fault detectors can be determined by selecting an appropriate linear combination of basis vectors by eliminating non-essential dynamics. The proposed approach is applicable to both standard and descriptor system descriptions.
منابع مشابه
On computing nullspace bases – a fault detection perspective
We discuss computationally efficient and numerically reliable algorithms to compute minimal proper nullspace bases of a rational or polynomial matrix. The underlying main computational tool is the orthogonal reduction to a Kronecker-like form of the system matrix of an equivalent descriptor system realization. A new algorithm is proposed to compute a simple minimal proper nullspace basis, start...
متن کاملA matrix nullspace approach for solving equality-constrained multivariable polynomial least-squares problems
We present an elimination theory-based method for solving equality-constrained multivariable polynomial least-squares problems in system identification.Whilemost algorithms in elimination theory rely upon Groebner bases and symbolic multivariable polynomial division algorithms, we present an algorithm which is based on computing the nullspace of a large sparse matrix and the zeros of a scalar, ...
متن کاملReliable algorithms for computing minimal dynamic covers for descriptor systems
Minimal dimension dynamic covers play an important role in solving the structural synthesis problems of minimum order functional observers or fault detectors, or in computing minimal order inverses or minimal degree solutions of rational equations. We propose numerically reliable algorithms to compute two basic types of minimal dimension dynamic covers for a linear system. The proposed approach...
متن کاملReliable algorithms for computing minimal dynamic covers
Minimal dimension dynamic covers play an important role in solving the structural synthesis problems of minimum order functional observers or fault detectors, or in computing minimal order inverses or minimal degree solutions of rational equations. We propose numerically reliable algorithms to compute two basic types of minimal dimension dynamic covers for a linear system. The proposed approach...
متن کاملFault Tolerant DNA Computing Based on Digital Microfluidic Biochips
Historically, DNA molecules have been known as the building blocks of life, later on in 1994, Leonard Adelman introduced a technique to utilize DNA molecules for a new kind of computation. According to the massive parallelism, huge storage capacity and the ability of using the DNA molecules inside the living tissue, this type of computation is applied in many application areas such as me...
متن کامل